- induced permutation
- мат.индуцированная перестановка
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Induced representation — In mathematics, and in particular group representation theory, the induced representation is one of the major general operations for passing from a representation of a subgroup H to a representation of the (whole) group G itself. It was initially … Wikipedia
Primitive permutation group — In mathematics, a permutation group G acting on a set X is called primitive if G preserves no nontrivial partition of X . In the other case, G is imprimitive. An imprimitive permutation group is an example of an induced representation; examples… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
Cycle index — In mathematics, and in particular in the field of combinatorics, cycle indices are used in combinatorial enumeration when symmetries are to be taken into account. This is particularly important in species theory. Each permutation π of a finite… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
System of imprimitivity — The concept of system of imprimitivity is used in mathematics, particularly in algebra and analysis, both within the context of the theory of group representations. It was used by George Mackey as the basis for his theory of induced unitary… … Wikipedia
Mathieu group — Group theory Group theory … Wikipedia
Determinant — This article is about determinants in mathematics. For determinants in epidemiology, see Risk factor. In linear algebra, the determinant is a value associated with a square matrix. It can be computed from the entries of the matrix by a specific… … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Classifying space for U(n) — In mathematics, the classifying space for the unitary group U(n) is a space B(U(n)) together with a universal bundle E(U(n)) such that any hermitian bundle on a paracompact space X is the pull back of E by a map X → B unique up to homotopy. This… … Wikipedia